/*
package com.ch.贪心;

*/
/**
 * @author chenhong
 * @version 1.0.0
 * @ClassName N605.java
 * @Description TODO
 * @createTime 2021年04月05日 20:56:00
 *//*

public class N605 {
}
class Solution605 {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
        for(int i =0;i< flowerbed.length;i++){
            if(flowerbed[i] == 0){
                if(i == 0 && flowerbed[i+1] == 0 ){
                    
                }else if(i == flowerbed.length - 1 && flowerbed[i - 1]==0){

                }else if(flowerbed[i+1] == 0 && flowerbed[i - 1]==0){

                }
            }


        }

    }
}*/
